Перевод: с английского на русский

с русского на английский

finite complement

См. также в других словарях:

  • Complement (group theory) — In mathematics, especially in the area of algebra known as group theory, a complement of a subgroup H in a group G is a subgroup K of G such that G = HK = { hk : h ∈ H and k ∈ K } and H ∩ K = {e}, that is, if every element of G has a unique… …   Wikipedia

  • Finite topological space — In mathematics, a finite topological space is a topological space for which the underlying point set is finite. That is, it is a topological space for which there are only finitely many points.While topology is mostly interesting only for… …   Wikipedia

  • Complement (complexity) — In computational complexity theory, the complement of a decision problem is the decision problem resulting from reversing the yes and no answers. Equivalently, if we define decision problems as sets of finite strings, then the complement of this… …   Wikipedia

  • Complément orthogonal — En mathématiques, plus précisément en algèbre linéaire et en analyse fonctionnelle, le complément orthogonal d un sous espace vectoriel W d un espace préhilbertien V est l ensemble des vecteurs de V qui sont orthogonaux à tout vecteur de W, c est …   Wikipédia en Français

  • Locally finite collection — In the mathematical field of topology, local finiteness is a property of collections of subsets of a topological space. It is fundamental in the study of paracompactness and topological dimension. A collection of subsets of a topological space X… …   Wikipedia

  • Orthogonal complement — In the mathematical fields of linear algebra and functional analysis, the orthogonal complement W⊥ of a subspace W of an inner product space V is the set of all vectors in V that are orthogonal to every vector in W (Halmos 1974, p. 123):… …   Wikipedia

  • Representation theory of finite groups — In mathematics, representation theory is a technique for analyzing abstract groups in terms of groups of linear transformations. See the article on group representations for an introduction. This article discusses the representation theory of… …   Wikipedia

  • Two's complement — The two s complement of a binary number is defined as the value obtained by subtracting the number from a large power of two (specifically, from 2 N for an N bit two s complement).A two s complement system or two s complement arithmetic is a… …   Wikipedia

  • Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… …   Wikipedia

  • Σ-finite measure — In mathematics, a positive (or signed) measure mu; defined on a sigma; algebra Sigma; of subsets of a set X is called finite, if mu;( X ) is a finite real number (rather than ∞). The measure mu; is called σ finite, if X is the countable union of… …   Wikipedia

  • Schur complement method — The Schur complement method is the basic and the earliest version of non overlapping domain decomposition method, also called iterative substructuring. A finite element problem is split into non overlapping subdomains, and the unknowns in the… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»